Characterization of ellipsoids as K-dense sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random dense countable sets: characterization by independence

A random dense countable set is characterized (in distribution) by independence and stationarity. Two examples are Brownian local minima and unordered infinite sample. They are identically distributed; the former ad hoc proof of this fact is now superseded by a general result. Introduction Random dense countable sets arise naturally from various probabilistic models. Their examination is impede...

متن کامل

Unusually dense crystal packings of ellipsoids.

In this Letter, we report on the densest-known packings of congruent ellipsoids. The family of new packings consists of crystal arrangements of spheroids with a wide range of aspect ratios, and with density phi always surpassing that of the densest Bravais lattice packing phi approximately equal to 0.7405. A remarkable maximum density of phi approximately equal to 0.7707 is achieved for maximal...

متن کامل

Characterization of Ellipses as Uniformly Dense Sets with Respect to a Family of Convex Bodies

Let K ⊂ R be a convex body containing the origin. A measurable set G ⊂ R with positive Lebesgue measure is said to be uniformly K-dense if, for any fixed r > 0, the measure of G ∩ (x + rK) is constant when x varies on the boundary of G (here, x + rK denotes a translation of a dilation of K). We first prove that G must always be strictly convex and at least C-regular; also, if K is centrally sym...

متن کامل

Minimum Volume Enclosing Ellipsoids and Core Sets

Abstract. We study the problem of computing a (1 + )-approximation to the minimum volume enclosing ellipsoid of a given point set S = {p1, p2, . . . , pn} ⊆ Rd. Based on a simple, initial volume approximation method, we propose a modification of Khachiyan’s first-order algorithm. Our analysis leads to a slightly improved complexity bound of O(nd3/ ) operations for ∈ (0, 1). As a byproduct, our ...

متن کامل

Dense Admissible Sets

Call a set of integers {b1, b2, . . . , bk} admissible if for any prime p, at least one congruence class modulo p does not contain any of the bi. Let ρ ∗(x) be the size of the largest admissible set in [1, x]. The Prime k-tuples Conjecture states that any for any admissible set, there are infinitely many n such that n+b1, n+b2, . . . n+bk are simultaneously prime. In 1974, Hensley and Richards ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Royal Society of Edinburgh: Section A Mathematics

سال: 2016

ISSN: 0308-2105,1473-7124

DOI: 10.1017/s030821051500044x